skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Hwang, Michael"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract Adjuvants play a central role in enhancing the immunogenicity of otherwise poorly immunogenic vaccine antigens. Combining adjuvants has the potential to enhance vaccine immunogenicity compared with single adjuvants, although the cellular and molecular mechanisms of combination adjuvants are not well understood. Using the influenza virus hemagglutinin H5 antigen, we define the immunological landscape of combining CpG and MPLA (TLR-9 and TLR-4 agonists, respectively) with a squalene nanoemulsion (AddaVax) using immunologic and transcriptomic profiling. Mice immunized and boosted with recombinant H5 in AddaVax, CpG+MPLA, or AddaVax plus CpG+MPLA (IVAX-1) produced comparable levels of neutralizing antibodies and were equally well protected against the H5N1 challenge. However, after challenge with H5N1 virus, H5/IVAX-1–immunized mice had 100- to 300-fold lower virus lung titers than mice receiving H5 in AddaVax or CpG+MPLA separately. Consistent with enhanced viral clearance, unsupervised expression analysis of draining lymph node cells revealed the combination adjuvant IVAX-1 significantly downregulated immune homeostasis genes, and induced higher numbers of antibody-producing plasmablasts than either AddaVax or CpG+MPLA. IVAX-1 was also more effective after single-dose administration than either AddaVax or CpG+MPLA. These data reveal a novel molecular framework for understanding the mechanisms of combination adjuvants, such as IVAX-1, and highlight their potential for the development of more effective vaccines against respiratory viruses. 
    more » « less
  2. Introduction The notion of a single localized store of word representations has become increasingly less plausible as evidence has accumulated for the widely distributed neural representation of wordform grounded in motor, perceptual, and conceptual processes. Here, we attempt to combine machine learning methods and neurobiological frameworks to propose a computational model of brain systems potentially responsible for wordform representation. We tested the hypothesis that the functional specialization of word representation in the brain is driven partly by computational optimization. This hypothesis directly addresses the unique problem of mapping sound and articulation vs. mapping sound and meaning. Results We found that artificial neural networks trained on the mapping between sound and articulation performed poorly in recognizing the mapping between sound and meaning and vice versa. Moreover, a network trained on both tasks simultaneously could not discover the features required for efficient mapping between sound and higher-level cognitive states compared to the other two models. Furthermore, these networks developed internal representations reflecting specialized task-optimized functions without explicit training. Discussion Together, these findings demonstrate that different task-directed representations lead to more focused responses and better performance of a machine or algorithm and, hypothetically, the brain. Thus, we imply that the functional specialization of word representation mirrors a computational optimization strategy given the nature of the tasks that the human brain faces. 
    more » « less
  3. Chakrabarti, Amit; Swamy, Chaitanya (Ed.)
    A Boolean maximum constraint satisfaction problem, Max-CSP(f), is specified by a predicate f:{-1,1}^k → {0,1}. An n-variable instance of Max-CSP(f) consists of a list of constraints, each of which applies f to k distinct literals drawn from the n variables. For k = 2, Chou, Golovnev, and Velusamy [Chou et al., 2020] obtained explicit ratios characterizing the √ n-space streaming approximability of every predicate. For k ≥ 3, Chou, Golovnev, Sudan, and Velusamy [Chou et al., 2022] proved a general dichotomy theorem for √ n-space sketching algorithms: For every f, there exists α(f) ∈ (0,1] such that for every ε > 0, Max-CSP(f) is (α(f)-ε)-approximable by an O(log n)-space linear sketching algorithm, but (α(f)+ε)-approximation sketching algorithms require Ω(√n) space. In this work, we give closed-form expressions for the sketching approximation ratios of multiple families of symmetric Boolean functions. Letting α'_k = 2^{-(k-1)} (1-k^{-2})^{(k-1)/2}, we show that for odd k ≥ 3, α(kAND) = α'_k, and for even k ≥ 2, α(kAND) = 2α'_{k+1}. Thus, for every k, kAND can be (2-o(1))2^{-k}-approximated by O(log n)-space sketching algorithms; we contrast this with a lower bound of Chou, Golovnev, Sudan, Velingker, and Velusamy [Chou et al., 2022] implying that streaming (2+ε)2^{-k}-approximations require Ω(n) space! We also resolve the ratio for the "at-least-(k-1)-1’s" function for all even k; the "exactly-(k+1)/2-1’s" function for odd k ∈ {3,…,51}; and fifteen other functions. We stress here that for general f, the dichotomy theorem in [Chou et al., 2022] only implies that α(f) can be computed to arbitrary precision in PSPACE, and thus closed-form expressions need not have existed a priori. Our analyses involve identifying and exploiting structural "saddle-point" properties of this dichotomy. Separately, for all threshold functions, we give optimal "bias-based" approximation algorithms generalizing [Chou et al., 2020] while simplifying [Chou et al., 2022]. Finally, we investigate the √ n-space streaming lower bounds in [Chou et al., 2022], and show that they are incomplete for 3AND, i.e., they fail to rule out (α(3AND})-ε)-approximations in o(√ n) space. 
    more » « less
  4. Abstract Field-effect transistor (FET)-based biosensors allow label-free detection of biomolecules by measuring their intrinsic charges. The detection limit of these sensors is determined by the Debye screening of the charges from counter ions in solutions. Here, we use FETs with a deformed monolayer graphene channel for the detection of nucleic acids. These devices with even millimeter scale channels show an ultra-high sensitivity detection in buffer and human serum sample down to 600 zM and 20 aM, respectively, which are ∼18 and ∼600 nucleic acid molecules. Computational simulations reveal that the nanoscale deformations can form ‘electrical hot spots’ in the sensing channel which reduce the charge screening at the concave regions. Moreover, the deformed graphene could exhibit a band-gap, allowing an exponential change in the source-drain current from small numbers of charges. Collectively, these phenomena allow for ultrasensitive electronic biomolecular detection in millimeter scale structures. 
    more » « less